Grover’s Algorithm for Multiobject Search in Quantum Computing
نویسندگان
چکیده
L. K. Grover’s search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover’s algorithm in a Hilbert-space framework that isolates its geometrical essence, and we generalize it to the case where more than one object satisfies the search criterion. In memory of Daniel Walls 1. Department of Mathematics, Texas A&M University, College Station, TX 77843-3368. 2. Supported in part by Texas A&M University Interdisciplinary Research Grant IRI 99-22. 3. Department of Physics and Institute for Quantum Studies, Texas A&M University, College Station, TX 77843-4242, and Max-Planck Institut für Quantenoptik, Munich. 4. Supported in part by ONR, NSF, and Welch Foundation.
منابع مشابه
Generalization of Grover’s Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time
L. K. Grover’s search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover’s algorithm in a Hilbert-space framework for both continuous and discrete time cases that isolates its geometrical essence to the case where more than one object satisfies the search criterion. 1. Department ...
متن کاملStrength and Weakness in Grover’s Quantum Search Algorithm
Grover’s quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with N records in O( √ N) assuming that the item must exist in the database with quadratic speedup over the best known classical algorithm. This review paper discusses the performance of Grover’s algorithm in case of multiple matche...
متن کاملSimulation of Grover’s quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
We implement Grover’s quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity...
متن کاملGeneralized Quantum Search with Parallelism
We generalize Grover’s unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover’s algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use ...
متن کاملThe Algorithm on a Quantum Computer with Power Queries
In this summary we discuss two new algorithms for Grover’s unsorted database search problem that claimed to have reached exponential speedup over Grover’s original algorithm. One is in the quantum setting with “power queries” that allow for exponential reduction in the number of queries over Grover’s original algorithm with “bit queries”. The other is to use “dubit queries” on a duality compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999